Hamiltonian decomposition of recursive circulant graphs
نویسنده
چکیده
The graph G(N; d) has vertex set V = {0; 1; : : : ; N − 1}, with {v; w} an edge if v − w ≡ ±di(modN ) for some 06i6dlogd Ne − 1. We show that the circulant graph G(cd; d) is Hamilton decomposable for all positive integers c; d, and m with c¡d. This extends work of Micheneau and answers a special case of a question of Alspach. c © 2000 Elsevier Science B.V. All rights reserved.
منابع مشابه
Hamiltonian Decomposition of Recursive
We show that recursive circulant G(cd m ; d) is hamiltonian decomposable. Recursive circulant is a graph proposed for an interconnection structure of multicomputer networks in [8]. The result is not only a partial answer to the problem posed by Alspach that every connected Cayley graph over an abelian group is hamiltonian decomposable, but also an extension of Micheneau's that recursive circula...
متن کاملDisjoint Hamiltonian Cycles in Recursive Circulant Graphs
We show in this paper that the circulant graph G( 2”‘, 4) is Hamiltonian decomposable, and propose a recursive construction method. This is a partial answer to a problem posed by B. Alspach. @ 1997 Published by Elsevier Science B.V.
متن کاملAn Improved Construction Method for MIHCs on Cycle Composition Networks
Many well-known interconnection networks, such as kary n-cubes, recursive circulant graphs, generalized recursive circulant graphs, circulant graphs and so on, are shown to belong to the family of cycle composition networks. Recently, various studies about mutually independent hamiltonian cycles, abbreviated as MIHC’s, on interconnection networks are published. In this paper, using an improved ...
متن کاملPermanents of Circulants: a Transfer Matrix Approach (expanded Version) *
Calculating the permanent of a (0, 1) matrix is a #P -complete problem but there are some classes of structuredmatrices for which the permanent is calculable in polynomial time. The most well-known example is the fixedjump (0, 1) circulant matrix which, using algebraic techniques, was shown by Minc to satisfy a constant-coefficient fixed-order recurrence relation. In this note we show how, by i...
متن کاملA recursively construction scheme for super fault-tolerant hamiltonian graphs
For the interconnection network topology, it is usually represented by a graph. When a network is used, processors and/or links faults may happen. Thus, it is meaningful to consider faulty networks. We consider k-regular graphs in this paper. We define a k-regular hamiltonian and hamiltonian connected graph G is super fault-tolerant hamiltonian if G remains hamiltonian after removing at most k ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 214 شماره
صفحات -
تاریخ انتشار 2000